منابع مشابه
Condensation of Boolean Formulas
Backgrounds and Motivations. Conventional complexity theory gives us only asymptotic information and does not give us any information about the complexity of each individual instance. It is also true, however, that many of us are feeling that the complexity of each instance is quite different from one to another. Instance complexity, denoted by ic(x : A), has been thus introduced [7, 9] as a me...
متن کاملSolving Quantified Boolean Formulas
Solving Quantified Boolean Formulas Horst Samulowitz Doctor of Philosophy Graduate Department of Computer Science University of Toronto 2007 Many real-world problems do not have a simple algorithmic solution and casting these problems as search problems is often not only the simplest way of casting them, but also the most efficient way of solving them. In this thesis we will present several tec...
متن کاملDensity Condensation of Boolean Formulas
The following problem is considered: given a Boolean formula f, generate another formula g such that: (i) If f is unsatisfiable then g is also unsatisfiable. (ii) If f is satisfiable then g is also satisfiable and furthermore g is “easier” than f. For the measure of this easiness, we use the density of a formula f which is defined as (the number of satisfying assignments)/2n, where n is the num...
متن کاملAutomated Reencoding of Boolean Formulas
We present a novel preprocessing technique to automatically reduce the size of Boolean formulas. This technique, called Bounded Variable Addition (BVA), exchanges clauses for variables. Similar to other preprocessing techniques, BVA greedily lowers the sum of variables and clauses, a rough measure for the hardness to solve a formula. We show that cardinality constraints (CCs) can efficiently be...
متن کاملSymmetries of Quantified Boolean Formulas
While symmetries are well understood for Boolean formulas and successfully exploited in practical SAT solving, less is known about symmetries in quantified Boolean formulas (QBF). There are some works introducing adaptions of propositional symmetry breaking techniques, with a theory covering only very specific parts of QBF symmetries. We present a general framework that gives a concise characte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2013
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2012.12.006